The maximal error capacity of arbitrarily varying channels for constant list sizes
نویسندگان
چکیده
منابع مشابه
Capacity Results for Arbitrarily Varying Wiretap Channels
In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede’s robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the ...
متن کاملOn error exponents for arbitrarily varying channels
The minimum probability of error achievable by random codes on the arbitrarily varying channel (AVC) is investigated. New exponential error bounds are found and applied to the AVC with and without input and state constraints. Also considered is a simple subclass of random codes, called randomly modulated codes, in which encoding and decoding operations are separate from code randomization. A un...
متن کاملDeterministic list codes for state-constrained arbitrarily varying channels
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....
متن کاملCapacity and decoding rules for classes of arbitrarily varying channels
Ahstrucf -We consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error critenon and, typically, subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy)...
متن کاملGaussian arbitrarily varying channels
The arbitrarily varying channel (AVC) can be interpreted as a model of a channel jammed by an intelligent and unpredictable adversary. We investigate the asymptotic reliability of optimal random block codes on Gaussian arbitrarily varying channels (GAVC’s). A GAVC is a discrete-time memoryless Gaussian channel with input power constraint PT and noise power N,, which is further corrupted by an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1993
ISSN: 0018-9448
DOI: 10.1109/18.243460